Task Graph Extraction for Embedded System Synthesis

نویسندگان

  • Keith S. Vallerio
  • Niraj K. Jha
چکیده

Consumer demand and improvements in hardware have caused distributed real-time embedded systems to rapidly increase in complexity. As a result, designers faced with timeto-market constraints are forced to rely on intelligent design tools to enable them to keep up with demand. These tools are continually being used earlier in the design process when the design is at higher levels of abstraction. At the highest level of abstraction are hardware/software co-synthesis tools which take a system specification as input. Although many embedded systems are described in C, the system specifications for many of these tools are often in the form of one or more task graphs. These tools are very effective at solving the co-synthesis problem using task graphs but require that designers manually transform the specification from C code to task graphs, a tedious and error-prone job. The task graph extraction tool described in this paper reduces the potential for error and the time required to design an embedded system by automating the task graph extraction process. Such a tool can drastically improve designer productivity. As far as we know, this is the first tool of its kind. It has been made available on the web.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CAD tool for hardware software co-synthesis of heterogeneous multiple processor embedded architectures

Hardware software co-synthesis process intends to determine an optimal architecture for an embedded application specified by a task graph or a specification language. In this paper, we present a cosynthesis approach targeting MPSoCs and distributed memory multiprocessor architectures for high performance embedded applications. Our co-synthesis approach produces pipelined multiprocessor architec...

متن کامل

A Software Synthesis Method for Building Real-Time Systems from Processing Graphs

Embedded signal processing applications are commonly designed using a processing graph software architecture. Unfortunately, existing technology does not support mapping general processing graphs to predictable real-time systems that use on-line scheduling. In this paper, we present software synthesis techniques that create a real-time uniprocessor system from processing graphs. Our synthesis m...

متن کامل

Instruction Generation for Hybrid Reconfigurable Systems

Regularity extraction attempts to find common sub-structures (templates) in one or a collection of circuits (graphs). There are many applications for regularity extraction, including, but not limited to, compiler instruction generation and selection for hybrid (re)configurable systems, scheduling during logic synthesis, system-level partitioning and FPGA mapping and placement. We aim to build a...

متن کامل

COFTA: Hardware-Software Co-Synthesis of Heterogeneous Distributed Embedded Systems

Embedded systems employed in critical applications demand high reliability and availability in addition to high performance. Hardware-software co-synthesis of an embedded system is the process of partitioning, mapping, and scheduling its specification into hardware and software modules to meet performance, cost, reliability, and availability goals. In this paper, we address the problem of hardw...

متن کامل

Allocation and scheduling of conditional task graph in hardwarelsoftware co-s ynthesis

This paper introduces an allocation and scheduling algorithm that eflciently handles conditional execution in multi-rate embedded system. Control dependencies are introduced into the task graph model. We propose a mutual exclusion detection algorithm that helps the scheduling algorithm to exploit the resource sharing. Allocation and scheduling are performed simultaneously to take advantage of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003